A dynamically adaptive sparse grids method for quasi-optimal interpolation of multidimensional functions
نویسندگان
چکیده
منابع مشابه
A Dynamically Adaptive Sparse Grid Method for Quasi-Optimal Interpolation of Multidimensional Analytic Functions
In this work we develop a dynamically adaptive sparse grids (SG) method for quasi-optimal interpolation of multidimensional analytic functions defined over a product of one dimensional bounded domains. The goal of such approach is to construct an interpolant in space that corresponds to the “best M -terms” based on sharp a priori estimate of polynomial coefficients. In the past, SG methods have...
متن کاملA Multigrid Method for Adaptive Sparse Grids
Sparse grids have become an important tool to reduce the number of degrees of freedom of discretizations of moderately high-dimensional partial differential equations; however, the reduction in degrees of freedom comes at the cost of an almost dense and unconventionally structured system of linear equations. To guarantee overall efficiency of the sparse grid approach, special linear solvers are...
متن کاملA quasi-optimal sparse grids procedure for groundwater flows
In this work we explore the extension of the quasi-optimal sparse grids method proposed in our previous work “On the optimal polynomial approximation of stochastic PDEs by Galerkin and Collocation methods” to a Darcy problem where the permeability is modeled as a lognormal random field. We propose an explicit a-priori/a-posteriori procedure for the construction of such quasi-optimal grid and sh...
متن کاملAdaptive sparse grids
Sparse grids, as studied by Zenger and Griebel in the last 10 years have been very successful in the solution of partial differential equations, integral equations and classification problems. Adaptive sparse grid functions are elements of a function space lattice. It is seen that such lattices allow the generalisation of sparse grid techniques to the fitting of very high-dimensional functions ...
متن کاملAdaptive Interpolation of Multidimensional Scaling
The recent explosion of publicly available biology gene sequences and chemical compounds offers an unprecedented opportunity for data mining. To make data analysis feasible for such vast volume and high-dimensional scientific data, we apply high performance dimension reduction algorithms. It facilitates the investigation of unknown structures in a three dimensional visualization. Among the know...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2016
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2015.12.045